Improving index performance through prefetching
نویسندگان
چکیده
منابع مشابه
Improving Index Performance through Prefetching (CMU-CS-00-177)
This paper proposes and evaluates Prefetching B-Trees (pB-Trees), which use prefetching to accelerate two important operations on B-Tree indices: searches and range scans. To accelerate searches, pB-Trees use prefetching to e ectively create wider nodes than the natural data transfer size: e.g., eight vs. one cache lines or disk pages. These wider nodes reduce the height of the B-Tree, thereby ...
متن کاملImproving Read Performance with Online Access Pattern Analysis and Prefetching
Among the major challenges of transitioning to exascale in HPC is the ubiquitous I/O bottleneck. For analysis and visualization applications in particular, this bottleneck is exacerbated by the write-onceread-many property of most scientific datasets combined with typically complex access patterns. One promising way to alleviate this problem is to recognize the application’s access patterns and...
متن کاملImproving Performance of Customer Relationship Management through Applying Knowledge Management
Customer Relationship Management (CRM) and Knowledge Management (KM) have become especial and strategic keys in the current competitive environment for all companies. The critical role of KM as the main determinant of the success of CRM has been the focal point of the previous researches; the present paper aimed at studying the impact of different KM factors- such as Customer Knowledge (CK), S...
متن کاملImproving Employee Satisfaction Priority through Performance Control Matrix
The study addresses Performance Control Matrix (PCM) to determine service quality items of priority for improvement. Most businesses focus on customer satisfaction when undertaking surveys of satisfaction and dissatisfaction, while generally neglecting employee satisfaction. Therefore, this study develops an integrated model to improve service quality in Taiwanese finance industry employees. A ...
متن کاملImproving Cache Performance through Tiling
We address the problem of improving the data cache performance of numerical applications { speci cally, those with blocked (or tiled) loops. We present DAT, a data alignment technique utilizing arraypadding, to improve program performance through minimizing cache con ict misses. We describe algorithms for selecting tile sizes for maximizing data cache utilization, and computing pad sizes for el...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGMOD Record
سال: 2001
ISSN: 0163-5808
DOI: 10.1145/376284.375688